Domain Compilation for Embedded Real-Time Planning
نویسنده
چکیده
While universal plans tell a system how to reach a goal regardless of what state it is in, such plans are typically too large to represent. Hybrid systems execute plans where each action is implemented to robustly produce effects if the world does not stray outside the action’s control envelope. This paper presents a middle ground between these two extremes that uses plans, but also enables much larger control envelopes using a real-time planner that finds optimal n step plans to achieve a set of goals if one exists.
منابع مشابه
Model Compilation for Embedded Real-Time Planning and Diagnosis
This paper describes MEXEC, an implemented model-compilation based executive that translates a device model into an internal structure. Not only does this structure facilitate computing the most likely current device mode from n sets of sensor measurements, but it also facilitates generating an n step reconfiguration plan that is most likely to result in reaching a target mode – if such a plan ...
متن کاملSHPE: HTN Planning for Video Games
This article describes SHPE (Simple Hierarchical Planning Engine), a hierarchical task network planning system designed to generate dynamic behaviours for real-time video games. SHPE is based on a combination of domain compilation and procedural task application/decomposition techniques in order to compute plans in a very short time-frame. The planner has been able to return relevant plans in l...
متن کاملThe Use of Sort Abstraction In Planning Domain Theories
This paper introduces a new planning algorithm which relies on a set ofiterative macros and a set of necessary goal ordering constraints that are generated during a compilation phase prior to planning. The main contribution of domain compilation is to speed up planning and is achieved at the price of a well specified domain model that has been engineered into a sort abstracted form. This means ...
متن کاملThe Use of Sort Abstraction In Planning Domain
This paper introduces a new planning algorithm which relies on a set of iterative macros and a set of necessary goal ordering constraints that are generated during a compilation phase prior to planning. The main contribution of domain compilation is to speed up planning and is achieved at the price of a well speciied domain model that has been engineered into a sort abstracted form. This means ...
متن کاملEngineering and Compiling Planning Domain Models to Promote Validity and Efficiency
This paper postulates a rigorous method for the construction of classical planning domain models. We describe, with the help of a non-trivial example, a tool supported method for encoding such models. The method results in anòbject-centred' speciication of the domain that lifts the representation from the level of the literal to the level of the object. Thus, for example, operators are deened i...
متن کامل